Reasoning about Protocols using Dijkstra’s Calculus
نویسندگان
چکیده
A mathematical model for the specification and verification of a data link layer protocol is proposed. The weakest precondition calculus, developed by Dijkstra, originally for sequential programs, has been chosen for this purpose. It is demonstrated that the wp–calculus provides a basis, not only for the modeling but also, for a straightforward and thorough analysis of large and complex distributed systems like data link layer protocol. This analysis contributes to the understanding of the system and could lead to an improvement in the design. The technique has been illustrated by describing the sliding window protocol.
منابع مشابه
GDP Festschrift ENTCS , to appear Protocol Composition Logic ( PCL )
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a process calculus with actions for possible protocol steps including generating new random numbers, sending and receiving messages, and performing decryption and digital signature verification actions. The proof system con...
متن کاملA Calculus of Cooperation and Game-Based Reasoning about Protocol Privacy
In 1933, Gödel [9] proposed a translation τ of intuitionistic propositional formulas into a modal language. Formula τ(F ) is obtained from formula F by placing the modality 2 in front of each subformula of formula F . He proved that if F is a theorem in intuitionistic propositional calculus IPL [12], then τ(F ) is provable in modal logic S4. The converse of this statement was later shown by McK...
متن کاملAutomatic Verification of Privacy Properties in the Applied pi Calculus
We develop a formal method verification technique for cryptographic protocols. We focus on proving observational equivalences of the kind P ∼ Q, where the processes P and Q have the same structure and differ only in the choice of terms. The calculus of ProVerif, a variant of the applied pi calculus, makes some progress in this direction. We expand the scope of ProVerif, to provide reasoning abo...
متن کاملImproved SPI Calculus for Reasoning on Cryptographic Protocols
Most of cryptographic protocols are subjects to very subtle attacks. Therefore, many researchers have developed tools to model and analyze protocols to guarantee their security properties. The spi calculus has proved to be useful for analyzing and reasoning on cryptographic protocols. However, current works assumed that the spi calculus dealt with transferring a single unstructured message for ...
متن کاملFramework for reasoning about cryptographic protocols with randomization
Context. Cryptographic protocols are distributed programs which use cryptographic primitives to secure communication over untrusted networks (such as the Internet). They are designed to achieve security properties such as confidentiality, authentication or anonymity. Due to the complexity of cryptographic primitives, the inherent concurrency and the untrusted nature of networks, their design ha...
متن کامل